The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path
نویسندگان
چکیده
منابع مشابه
Groups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملHamilton surfaces for the complete even symmetric bipartite graph
A cycle in a graph G is called a hamilton cycle if it contains every vertex of G. A l-factor of a graph G is a subgraph H of G with the same vertex set as G, such that each vertex of H has degree one. Ringel [S] has generalized the idea of a hamilton cycle to two dimensions. He showed that if n is odd the set of squares in the n-dimensional cube Q,, can be partitioned into subsets such that eac...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [m. a. iranmanesh and c. e. praeger, bipartite divisor graphs for integer subsets, {em graphs combin.}, {bf 26} (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g...
متن کاملon bipartite divisor graph for character degrees
the concept of the bipartite divisor graph for integer subsets has been considered in [graph combinator., 26 (2010) 95--105.]. in this paper, we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph. we show that if $g$ is a solvable group, then the number of connected components of this graph is at most $2$ and if $g...
متن کاملAn Institution for Graph Transformation
The development of a denotational framework for graph transformation systems proved elusive so far. Despite the existence of many formalisms for modelling various notions of rewriting, the lack of an explicit, algebraic notion of “term” for describing a graph (thus different from the usual view of a graph as an algebra in itself) frustrated the efforts of the researchers. Resorting to the theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/j.am1.2003.12.002